A Graph Theoretic Approach to Key Equivalence
نویسندگان
چکیده
This paper is concerned with redundancy detection and elimination in databases via the solution of a key equivalence problem. The approach is related to the hardening of soft databases method due to Cohen et al., [4]. Here, the problem is described in graph theoretic terms. An appropriate optimization model is drawn and solved indirectly. This approach is shown to be effective. Computational results on test databases are included.
منابع مشابه
An Unsupervised Approach to Key Equivalence
In a previous paper we have suggested a graph-theoretic approach to the key equivalence problem. This approach is limited because, to work, it must be supervised. Here we alleviate this requirement by constraining potential solutions to the overall problem while they are generated by the graph-theoretic model already mentioned. This is equivalent to solving an implicit constrained optimisation ...
متن کاملA module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملA redundancy detection approach to mining bioinformatics data
This paper is concerned with the search for sequences of bases via the key equivalence problem. The approach is related to the hardening of soft databases method due to Cohen et al., [4]. Here, the problem is described in graph theoretic terms. An appropriate optimization model is drawn and solved indirectly. This approach is shown to be effective. Computational results on test databases are in...
متن کاملGraph equivalence and characterization via a continuous evolution of a physical analog
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto " physical " models-namely n simplexes in n−1 dimensions-is applied to the graph equivalence problem. It is shown to solve this long standing problem in polynomial, short, time.
متن کاملExact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کامل